Implementasi Algoritma Cheapest Insertion Heuristic (CIH) dalam Penyelesaian Travelling Salesman Problem (TSP)
نویسندگان
چکیده
منابع مشابه
The metric travelling salesman problem: pareto-optimal heuristic algorithms
The Metric Travelling Salesman Problem is a subcase of the Travelling Salesman Problem (TSP), where the triangle inequality holds. It is a key problem in combinatorial optimization. Solutions of the Metric TSP are generally used for costs minimization tasks in logistics, manufacturing and genetics. Since this problem is NP-hard, heuristic algorithms providing near optimal solutions in polynomia...
متن کاملClassical Travelling Salesman Problem (TSP) based Approach to Solve Fuzzy TSP using Yager’s Ranking
Bellman RE, Zadeh LA . 1970. Decision-making in a fuzzy environment, Manage. Sci. , 17: 141-164. Hannan EL 1981. Linear programming with multiple fuzzy goals. Fuzzy Sets Syst. , 6: 235-248 Hansen MP 2000. Use of substitute Scalarizing Functions to guide Local Search based Heuristics: The case of MOTSP, J. Heuristics, 6: 419-431 Jaszkiewicz A 2002. Genetic Local Search for Multiple Objectives Co...
متن کاملConstricting Insertion Heuristic for Traveling Salesman Problem with Neighborhoods
Sequence optimization is an important problem in many production automation scenarios involving industrial robots. Mostly, this is done by reducing it to Traveling Salesman Problem (TSP). However, in many industrial scenarios optimization potential is not only hidden in optimizing a sequence of operations but also in optimizing the individual operations themselves. From a formal point of view, ...
متن کاملModified Ant Colony Optimizer (MACO) for the Travelling Salesman Problem (TSP)
Travelling Salesman Problem (TSP) is a classical combinatorial optimization problem. This problem is NP-hard in nature. Meta-heuristic approaches have proved to be quite useful for approximate solution of difficult combinatorial optimization problems. Ant colony optimization is one of the popular Meta-heuristics and is unique on the basis of its distributed computation and indirect communicatio...
متن کاملThe multi-stripe travelling salesman problem
In the classical Travelling Salesman Problem (TSP), the objective function sums the costs for travelling from one city to the next city along the tour. In the q-stripe TSP with [Formula: see text], the objective function sums the costs for travelling from one city to each of the next q cities in the tour. The resulting q-stripe TSP generalizes the TSP and forms a special case of the quadratic a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Jurnal Online Informatika
سال: 2018
ISSN: 2527-9165,2528-1682
DOI: 10.15575/join.v3i1.218